SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
نویسندگان
چکیده
منابع مشابه
AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملA fast algorithm for sparse matrix computations related to inversion
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of nonequilibrium Green’s functions G and G for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width...
متن کاملFast Sparse Selected Inversion 1285
We propose a fast structured selected inversion method for extracting the diagonal blocks of the inverse of a sparse symmetric matrix A, using the multifrontal method and rank structures. When A arises from the discretization of some PDEs and has a low-rank property (the intermediate dense matrices in the factorization have small off-diagonal numerical ranks), structured approximations of the d...
متن کاملAn exact algorithm for sparse matrix bipartitioning
The sparse matrix partitioning problem arises when minimizing communication in parallel sparse matrix-vector multiplications. Since the problem is NP-hard, heuristics are usually employed to find solutions. Here, we present a purely combinatorial branch-and-bound method for computing optimal bipartitionings of sparse matrices, in the sense that they have the lowest communication volume out of a...
متن کاملPSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case
This paper generalizes the parallel selected inversion algorithm called PSelInv to sparse nonsymmetric matrices. We assume a general sparse matrix A has been decomposed as PAQ = LU on a distributed memory parallel machine, where L,U are lower and upper triangular matrices, and P,Q are permutation matrices, respectively. The PSelInv method computes selected elements of A. The selection is confin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2011
ISSN: 0098-3500,1557-7295
DOI: 10.1145/1916461.1916464